Every Simple Arrangement of n Lines Contains an Inducing Simple n-gon
نویسندگان
چکیده
We show that for any arrangement A of n lines in general position in the plane there exists a simple closed polygon with n edges having the property that every edge of the polygon lies on a distinct line of A.
منابع مشابه
Inducing n-gon of an arrangement of lines
We show that an arrangement A of n lines in general position in the plane with n ≥ 3 has an inducing polygon of size n. The proof is constructive, that is we describe an algorithm that constructs a simple ngon inducing A.
متن کاملOn Inducing Polygons and Related Problems
Bose et al. [1] asked whether for every simple arrangement A of n lines in the plane there exists a simple n-gon P that induces A by extending every edge of P into a line. We prove that such a polygon always exists and can be found in O(n log n) time. In fact, we show that every finite family of curves C such that every two curves intersect at least once and finitely many times and no three cur...
متن کاملInducing Polygons of Line Arrangements
We show that an arrangement A of n lines in general position in the plane has an inducing polygon of size O(n). Additionally, we present a simple algorithm for finding an inducing n-path for A in O(n log n) time and an algorithm that constructs an inducing n-gon for a special class of line arrangements within the same time bound. Eligible for best student paper
متن کاملArrangements of Lines with a Large Number of Triangles
An arrangement of lines is constructed by choosing n diagonals of the regular 2/i-gon. This arrangement is proved to form at least n(n 3)/3 triangular cells.
متن کاملOn Inducing n-gons
In this paper, we establish a lower bound on the number of inducing simple n-gons in grid-like arrangements of lines. We also show that the complexity associated with counting the number of inducing n-gons in an arrangement of collinear segments is #P-complete.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- The American Mathematical Monthly
دوره 118 شماره
صفحات -
تاریخ انتشار 2011